Schreier Graphs of an Extended Version of the Binary Adding Machine
نویسنده
چکیده
In this paper we give a complete classification of the infinite Schreier graphs of an automaton group generated by an extended version of the binary adding machine.
منابع مشابه
Just chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملNotes on the Schreier graphs of the Grigorchuk group
The paper is concerned with the space of the marked Schreier graphs of the Grigorchuk group and the action of the group on this space. In particular, we describe the invariant set of the Schreier graphs corresponding to the action on the boundary of the binary rooted tree and dynamics of the group action restricted to this invariant set.
متن کاملSharpness of KKL on Schreier graphs
Recently, the Kahn–Kalai–Linial (KKL) Theorem on influences of functions on {0, 1} was extended to the setting of functions on Schreier graphs. Specifically, it was shown that for an undirected Schreier graph Sch(G,X,U) with log-Sobolev constant ρ and generating set U closed under conjugation, if f : X → {0, 1} then E [f ] & log(1/M[f ]) · ρ ·Var[f ]. Here E [f ] denotes the average of f ’s inf...
متن کاملPrediction of Satranidazole Solubility in Water-Polyethylene Glycol 400 Mixtures Using Extended Hildebrand Solubility Approach
The Extended Hildebrand Solubility Parameter Approach (EHSA) is used to estimate the solubility of satranidazole in binary solvent systems. The solubility of satranidazole in various water-PEG 400 mixtures was analyzed in terms of solute-solvent interactions using a modified version of Hildebrand-Scatchard treatment for regular solutions. The solubility equation employs term interaction ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014